Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8
نویسندگان
چکیده
منابع مشابه
Finding discrete logarithms with a set orbit distinguisher
We consider finding discrete logarithms in a group G when the help of an algorithm D that distinguishes certain subsets of G from each other is available. For a group G of prime order p, if algorithm D is polynomialtime with complexity c(log(p)), we can find discrete logarithms faster than square-root algorithms. We consider two variations on this idea and give algorithms solving the discrete l...
متن کاملA Distinguisher for High Rate McEliece Cryptosystem
The purpose of this talk is to study the difficulty of the Goppa Code Distinguishing (GD) problem, which is the problem of distinguishing the public matrix in the McEliece cryptosystem from a random matrix. It is widely believed that this problem is computationally hard as proved by the increasing number of papers using this hardness assumption. One can consider that disproving/mitigating this ...
متن کاملDistinguisher for Shabal's Permutation Function
In this note we consider the Shabal permutation function P as a block cipher with input Ap,Bp and key C,M and describe a distinguisher with a data complexity of 2 random inputs with a given difference. If the attacker can control one chosen bit of Bp, only 2 21 inputs with a given difference are required on average. This distinguisher does not appear to lead directly to an attack on the full Sh...
متن کاملA generalization of the probability that the commutator of two group elements is equal to a given element
The probability that the commutator of two group elements is equal to a given element has been introduced in literature few years ago. Several authors have investigated this notion with methods of the representation theory and with combinatorial techniques. Here we illustrate that a wider context may be considered and show some structural restrictions on the group.
متن کاملA Sequential Distinguisher for Covert Channel Identification
Covert channels are of two types: (a) timing channel and (b) storage channel. Most previous works have studied these channels from the encoder’s perspective, namely, information theoretic capacity, algorithms and protocols for hiding information etc. This paper investigates the covert channel problem from an passive adversary’s perspective. A sequential distinguisher for storage channel identif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2018
ISSN: 0097-5397,1095-7111
DOI: 10.1137/16m1059461